Constraint-Theorems on the Prototypification of Shape
نویسنده
چکیده
Mathematical results are presented that strongly constrain the prototypification of complex shape. Such shape requires local prototypification in two senses: (1) prototypification occurs in parallel at different parts of the figure, and (2) prototypification varies diferentially (smoothly) across an individual part. With respect to (l), we present a theorem that states that every Hoffman-Richards codon has a unique Brady Smooth Local Symmetry. The theorem solves the issue of defining units for parallel decomposition, for it implies that a codon is the minimal unit with respect to the existence of prototypification via symmetry, and is mazimal with respect to prototypification via nonambiguous symmetry. Concerning issue (2) above, a further theorem is offered that severely limits the possible shapes that result from the sequential application of prototypifying operations to smoothly varying deformation. This second result explains why considerably fewer prototype classes exist than one would otherwise expect.
منابع مشابه
An effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملA new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملOn the fixed point theorems in generalized weakly contractive mappings on partial metric spaces
In this paper, we prove a fixed point theorem for a pair of generalized weakly contractive mappings in complete partial metric spaces. The theorems presented are generalizations of very recent fixed point theorems due to Abdeljawad, Karapinar and Tas. To emphasize the very general nature of these results, we illustrate an example.
متن کاملOn Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کامل